Fault-Tolerant Cycle Embedding in Dual-Cube with Node Faulty
نویسندگان
چکیده
A low-degree dual-cube was proposed as an alternative to the hypercubes. A dual-cube DC(m) has m + 1 links per node where m is the degree of a cluster (m-cube) and one more link is used for connecting to a node in another cluster. There are 2m+1 clusters and hence the total number of nodes is 22m+1 in a DC(m). In this paper, by using Gray code, we show that there exists a faulty-free cycle containing at least 22m+1−2 f nodes with f ≤ m−1 faulty
منابع مشابه
Fault-tolerant cycle embedding in dual-cube with node faults
A low-degree dual-cube was proposed as an alternative to the hypercubes. A dual-cube DC(m) has m + 1 links per node, where m is the degree of a cluster (m-cube) and one more link is used for connecting to a node in another cluster. There are 2 clusters and hence the total number of nodes in a DC(m) is 2 + . In this paper, by using Gray code, we show that there exists a fault-free cycle containi...
متن کاملHamiltonian Cycle Embedding for Fault Tolerance in Dual-cube
The hypercube has been widely used as the interconnection network (IN) in parallel computers. However, the major drawback of the hypercube is the increase in the number of communication links for each node with the increase in the total number of nodes in the system. A dual-cube DC(m) has m + 1 links per node where m is the degree of a cluster (m-cube), one more link is used for connecting to a...
متن کاملAdaptive-Subcube Fault Tolerant Routing in Dual-Cube with Very Large Number of Faulty Nodes
The dual-cube is a newly proposed interconnection network for linking a large amount of nodes with low node degree. It uses low-dimensional hypercubes as building blocks and keeps the main desired properties of the hypercubes. In this paper, we give an efficient algorithm for fault tolerant routing in dual-cube networks with a large number of faulty nodes. Our algorithm uses the adaptive-subcub...
متن کاملA Limited-Global Information Model for Fault-Tolerant Routing in Dual-Cube
We propose a fault-tolerant routing with its extensions based on limited global information in dual-cube networks. It is based on an early work of Wu’s safety level and safety vector in cube networks. An r-connected dual-cube network consists of 2rþ1 connected r-cubes (also called clusters). Both faulty nodes and faulty links are considered here. First, a depth-first search routing (DSBR) based...
متن کاملFault-Tolerant Routing and Disjoint Paths in Dual-Cube: A New Interconnection Network
In this paper, we introduce a new interconnection network, the dual-cube, its topological properties, and the routing/broadcasting algorithms in the dual-cube. The advanced subjects such as fault-tolerant routing and constructing multiple disjoint paths in dual-cubes are also included in this paper. The binary hypercube, or r-cube, can connect 2r nodes. In contrast, a dual-cube with r links for...
متن کامل